Failure-divergence semantics and refinement of long running transactions

Failure-divergence semantics and refinement of long running transactions

Compensating CSP (cCSP) models long-running transactions. It can be used tospecify service orchestrations written in programming languages like WS-BPEL.However, the original cCSP does not allow to model internal (non-deterministic)choice, synchronized parallel composition, hiding or recursion. In this paper, weintroduce these operators and define for the extended language a fail...

A Trace Semantics for Long-Running Transactions

A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be interrupted or fail in the middle, and it must not be interleaved with other atomic actions of other concurrently executing components of the system. In practice, the illusion of atomicity for a long-running transaction is ach...

An Operational Semantics for Model Checking Long Running Transactions

Refactoring Long Running Transactions

Sagas calculi have been proposed to specify distributed Long Running Transactions (LRT) and, in previous work, a subset of naive sagas has been encoded in the Signal Calculus (SC) to enable their use in service-oriented systems. Here, we promote a formal approach to the refactoring of LRT represented in SC so that distributed LRT designed in the Business Process Modelling Notation (BPMN) can be...

Failure-Divergence Refinement of Compensating Communicating Processes

Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provi...